Technical Report: On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs
نویسندگان
چکیده
Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large real-world graph instances. In this paper, we investigate the shortcomings of the conventional approach and propose a series of extensions that consider the fundamental properties of real-world graphs, e.g. the small-world property. Our scalable implementation offers excellent performance on diverse, small-world graphs resulting in a 4.44x to 23.98x parallel speedup over the optimal sequential algorithm with 8 cores and 16 hardware threads. Keywords-strongly connected components (SCC); multicore; parallel algorithms; graph algorithms; small-world graphs
منابع مشابه
Efficient, Reachability-based, Parallel Algorithms for Finding Strongly Connected Components∗ [Technical Report]
Large, complex graphs are increasingly used to represent unstructured data in scientific applications. Applications such as discrete ordinates methods for radiation transport require these graphs to be directed with all cycles eliminated, where cycles are identified by finding the graph.s strongly connected components (SCCs). Deterministic parallel algorithms identify SCCs in polylogarithmic ti...
متن کاملCS 224 W Project Final Report CUDA Implementation of Large Graph Algorithms Group
Running SCC graph algorithms on large datasets can be a time-consuming task, and we spent the quarter investigating methods of parallelizing this task using CUDA. For very large graphs, too much time can be wasted by not parallelizing the graph algorithms, and we want some of the insights from our experiments to be used to speed up common graph analysis tasks. We initially started by implementi...
متن کاملA Compiler Framework to Detect Parallelism in Irregular Codes
This paper describes a compiler framework that enhances the detection of parallelism in loops with complex irregular computations. The framework is based on the static analysis of the Gated Single Assignment (GSA) program representation. A taxonomy of the strongly connected components (SCCs) that appear in GSA dependence graphs is presented as the basis of our framework. Furthermore, an algorit...
متن کاملDistributed Algorithms for SCC Decomposition
We study existing parallel algorithms for the decomposition of a partitioned graph into its strongly connected components. In particular, we identify several individual procedures that the algorithms are assembled from and show how to assemble a new and more efficient algorithm, called Recursive OBF, to solve the decomposition problem. We also report on a thorough experimental study to evaluate...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کامل